SPECTRAL-SPATIAL CLASSIFICATION WITH K-MEANS++ PARTICIONAL CLUSTERING
نویسندگان
چکیده
منابع مشابه
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to find local minima. In this paper we show that the minimization can be reformulated as a trace maximization problem associated with the Gram matrix of the data vectors. Furthermore, we show that a relaxed version of the trace maximization problem possesse...
متن کاملSkin Cancer Classification Using K-Means Clustering
Detection of skin cancer gives the best chance of being diagnosed early. Biopsy method for skin cancer detection is much painful. Human interpretation contains difficulty and subjectivity therefore automated analysis of skin cancer affected images has become important. This paper proposes an automatic medical image classification method to classify two major type skin cancers: Melanoma, and Non...
متن کاملSpectral Rotation versus K-Means in Spectral Clustering
Spectral clustering has been a popular data clustering algorithm. This category of approaches often resort to other clustering methods, such as K-Means, to get the final cluster. The potential flaw of such common practice is that the obtained relaxed continuous spectral solution could severely deviate from the true discrete solution. In this paper, we propose to impose an additional orthonormal...
متن کاملMachine learning in APOGEE: Unsupervised spectral classification with K-means
Context. The data volume generated by astronomical surveys is growing rapidly. Traditional analysis techniques in spectroscopy either demand intensive human interaction or are computationally expensive. In this scenario, machine learning, and unsupervised clustering algorithms in particular offer interesting alternatives. The Apache Point Observatory Galactic Evolution Experiment (APOGEE) offer...
متن کاملRK-Means Clustering: K-Means with Reliability
This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the clustering result will become unreliable if the assumed number of the clusters is incorrect; 2) during the update of a cluster center, all the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Optics
سال: 2014
ISSN: 2412-6179,0134-2452
DOI: 10.18287/0134-2452-2014-38-2-281-286